A low-energy rate-adaptive bit-interleaved passive optical network

Energy consumption of customer premises equipment (CPE) has become a serious issue in the new generations of time-division multiplexing passive optical networks, which operate at 10 Gb/s or higher. It is becoming a major factor in global network energy consumption, and it poses problems during emergencies when CPE is battery-operated. In this paper, a low-energy passive optical network (PON) that uses a novel bit-interleaving downstream protocol is proposed. The details about the network architecture, protocol, and the key enabling implementation aspects, including dynamic traffic interleaving, rate-adaptive descrambling of decimated traffic, and the design and implementation of a downsampling clock and data recovery circuit, are described. The proposed concept is shown to reduce the energy consumption for protocol processing by a factor of 30. A detailed analysis of the energy consumption in the CPE shows that the interleaving protocol reduces the total energy consumption of the CPE significantly in comparison to the standard 10 Gb/s PON CPE. Experimental results obtained from measurements on the implemented CPE prototype confirm that the CPE consumes significantly less energy than the standard 10 Gb/s PON CPE

Random binary fingerprinting codes for arbitrarily sized coalitions

Abstract — New lower bounds are established on the rate of fingerprinting codes secure against coalitions of an arbitrary constant size t. In particular, it is proved that there exist sequences of binary fingerprinting codes with vanishing probability of misidentification and rate approximately 1/(t 2 2 t). In the case of t = 3 it is shown that there exist codes of rate 0.064 which is better by an order of magnitude than previously known results. I

Two-level fingerprinting codes

Abstract—We introduce the notion of two-level fingerprinting and traceability codes. In this setting, the users are organized in a hierarchical manner by classifying them into various groups; for instance, by dividing the distribution area into several geographic regions, and collecting users from the same region into one group. Two-level fingerprinting and traceability codes have the following property: As in traditional (one-level) codes, when given an illegal copy produced by a coalition of users, the decoder identifies one of the guilty users if the coalition size is less than a certain threshold t. Moreover, even when the coalition is of a larger size s (> t), the decoder still provides partial information by tracing one of the groups containing a guilty user. We establish sufficient conditions for a code to possess the two-level traceability property. In addition, we also provide constructions for two-level fingerprinting codes and characterize the corresponding set of achievable rates. I